On the Relations between Indiscernibility Degree and Cluster Number in Rough Clustering
نویسندگان
چکیده
This paper discusses the relationships between indiscernibility degree and clustering results in rough clustering. We first examine the relationship between the threshold value of indiscernibility degree and resultant clusters. After that, we apply random disturbance to the perfect relations, and examine how the result changes. The results implies the threshold-validity curve may have globally convex shape, and the best value may be selected according to the change of cluster numbers.
منابع مشابه
Rough Set Theory: Approach for Similarity Measure in Cluster Analysis
Clustering of data is an important data mining application. One of the problems with traditional partitioning clustering methods is that they partition the data into hard bound number of clusters. Rough set based Indiscernibility relation combined with indiscernibility graph, leads to knowledge discovery in an elegant way. Indiscernibilty relation has a strong appeal to be applied in clustering...
متن کاملClustering Binary Data Based on Rough Set Indiscernibility Level
In this paper, we present a new method of clustering binary data based on the combination of indiscernibility and its indiscernibility level. As a motivation of this method we consider core concept of classical rough sets are clustering similarities and dissimilarities of objects based on the notions of indiscernibility and discernibility. The indiscernibility level quantifies the indiscernibil...
متن کاملData analysis based on discernibility and indiscernibility
Rough set theory models similarities and differences of objects based on the notions of indiscernibility and discernibility. With respect to any subset of attributes, one can define two pairs of dual relations: the strong indiscernibility and weak discernibility relations, and the weak indiscernibility and strong discernibility relations. The similarities of objects are examined by the indiscer...
متن کاملAn Empirical Analysis of Rough Set Categorical Clustering Techniques
Clustering a set of objects into homogeneous groups is a fundamental operation in data mining. Recently, many attentions have been put on categorical data clustering, where data objects are made up of non-numerical attributes. For categorical data clustering the rough set based approaches such as Maximum Dependency Attribute (MDA) and Maximum Significance Attribute (MSA) has outperformed their ...
متن کاملMining Interesting Patterns in Time-series Medical Databases: A Hybrid Approach of Multiscale Matching and Rough Clustering
In this paper, we present an analysis method of time-series laboratory examination data based on multiscale matching and rough clustering. We obtain similarity of sequences by multi-scale matching, which compares two sequences throughout various scales of view. It has an advantage that connectivity of segments is preserved in the matching results even when the partial segments are obtained from...
متن کامل